#include<stdio.h>
#include<math.h>

int isprime(int x)
{
	int back=1;
	int i;
	if(x==1||(x%2==0&&x!=2)) back=0;
	for(i=3;i<=sqrt((double)x);i+=2){
		if(x%i==0){
			back=0;
			break;
		}
	}
	return back;
} 
int main()
{
	int flag,n,fb[41];
	scanf("%d",&n);
	fb[0]=1;
	fb[1]=1;
	for(flag=2;flag<40;flag++)
	{
		fb[flag]=fb[flag-1]+fb[flag-2];
	}
	if(isprime(fb[n-1])==1) printf("yes");
	else printf("%d",fb[n-1]);
	return 0;
} 
